Independent instances for some undecidable problems
نویسندگان
چکیده
منابع مشابه
Independent Instances for Some Undecidable Problems
— In this note we prove the existence of effectively independent instances (with respect to an arbitrary recursively axiomatizable, consistent, intuitively true and sufficiently rich theory) for some well-known undecidable problems including the Emptiness Problem, the Finiteness Problem, the Totality Problem, the Halting Problem and the Post Correspondence Problem. Applications in the Theory of...
متن کاملSome Undecidable Problems in Group Theory
In this paper we obtain general results for undecidable first order decision problems about groups (that is, problems about elements in a particular group, such as the word and conjugacy problems). We shall describe a class ii of such decision problems and a construction A such that if P is a problem in Q, then A(P) will be a finitely presented group in which P is recursively undecidable. This ...
متن کاملSome Undecidable Problems Related to the Herbrand Theorem
March 1997 (revised July 1997) ISSN 1100{0686 Some Undecidable Problems Related to the Herbrand Theorem Yuri Gurevich Margus Veanes EECS Department Computing Science Department University of Michigan Uppsala University Ann Arbor, MI 48109-2122 Box 311, S-751 05 Uppsala USA Sweden [email protected] [email protected] Abstract We improve upon a number of recent undecidability results related to th...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Some Highly Undecidable Lattices
Let S be a Steinitz Exchange System with closure operation cl (see e.g. [5] for definitions). In this paper we examine the logical complexity of the first-order theory of the lattice of cl-closed subsets of S. (In the first-order language for lattices we use symbols for meet, join, and the elements zero and one.) As quantification over the elements of the lattice is quantification over some of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1983
ISSN: 0399-0540
DOI: 10.1051/ita/1983170100491